Establishing connections between Formal Concept Analysis and Relational Databases
نویسنده
چکیده
The relationship between relational databases and formal concept analysis (FCA) has been the topic of several papers in the past. This paper intends to extend some of the ideas presented in the previous papers by analysing the relationship between FCA and two central notions of relational databases: database schemata and normalforms. An object-relational algebra is suggested in this paper as a possible future replacement of relational algebra.
منابع مشابه
An Application of Relation Algebra to Lexical Databases
This paper presents an application of relation algebra to lexical databases. The semantics of knowledge representation formalisms and query languages can be provided either via a set-theoretic semantics or via an algebraic structure. With respect to formalisms based on n-ary relations (such as relational databases or power context families), a variety of algebras is applicable. In standard rela...
متن کاملModelling Lexical Databases with Formal Concept Analysis
This paper provides guidelines and examples for visualising lexical relations using Formal Concept Analysis. Relations in lexical databases often form trees, imperfect trees or poly-hierarchies which can be embedded into concept lattices. Manyto-many relations can be represented as concept lattices where the values from one domain are used as the formal objects and the values of the other domai...
متن کاملFast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
Fixpoints of Galois connections induced by object-attribute data tables represent important patterns that can be found in relational data. Such patterns are used in several data mining disciplines including formal concept analysis, frequent itemset and association rule mining, and Boolean factor analysis. In this paper we propose efficient algorithm for listing all fixpoints of Galois connectio...
متن کاملMerging Closed Pattern Sets in Distributed Multi-Relational Data
We consider the problem of mining closed patterns from multi-relational databases in a distributed environment. Given two local databases (horizontal partitions) and their sets of closed patterns (concepts), we generate the set of closed patterns in the global database by utilizing the merge (or subposition) operator, studied in the field of Formal Concept Analysis. Since the execution times of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005